Generators and Colimit Closures
نویسنده
چکیده
The only proof of this I know is kind of fiddly and not enlightening. But the point is that in most categories that appear ‘in nature,’ regular, strong, and extremal epics are about the same, and all are the correct notion of quotient, while ordinary epimorphisms may not be. For example, N→ Q is epic in Rings, but not extremal epic. In Top the epics are the surjective maps, while the regular = strong = extremal epics are the quotient maps. If you were at Emily’s talk on factorization systems, it is natural to wonder: since strong epics are left orthogonal to monics, i.e. StrEpi = ⊥Mono, when is (StrEpi ,Mono) an orthogonal factorization system? It would suffice to show that any map factors as an extremal epic followed by a monic. Here’s a natural way to do that: given f : X → Y , take its kernel pair, which is the pullback
منابع مشابه
Totality of colimit closures
Adámek, Herrlich, and Reiterman showed that a cocomplete category A is cocomplete if there exists a small (full) subcategory B such that every A-object is a colimit of B-objects. The authors of the present paper strengthened the result to totality in the sense of Street and Walters. Here we weaken the hypothesis, assuming only that the colimit closure is attained by transfinite iteration of the...
متن کامل2 00 4 Virtual Braids
Just as classical knots and links can be represented by the closures of braids, so can virtual knots and links be represented by the closures of virtual braids [17]. Virtual braids have a group structure that can be described by generators and relations, generalizing the generators and relations of the classical braid group. This structure of virtual braids is worth study for its own sake. The ...
متن کاملVirtual Braids
Just as classical knots and links can be represented by the closures of braids, so can virtual knots and links be represented by the closures of virtual braids [16]. Virtual braids have a group structure that can be described by generators and relations, generalizing the generators and relations of the classical braid group. This structure of virtual braids is worth study for its own sake. The ...
متن کاملConstructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the de nition of a variety of association rule bases. Although their joint computation has been studied in concept analysis, no scalable algorithm exists for the task at present. We propose here to reverse a method from the latter eld using a fundamental property of hypergraph theory. ...
متن کاملToric Ideals of Integral Closures from Graphs
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any polynomial ring generated by quadratic monomials. The toric ideal of relations between these generators is generated by a set of graphically described binomials. The spectra of the original ring and of its integral closure turn out to be canonicall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015